Lamarckian memetic algorithms: local optimum and connectivity structure analysis
نویسندگان
چکیده
منابع مشابه
Lamarckian memetic algorithms: local optimum and connectivity structure analysis
Memetic Algorithms (MAs) represent an emerging field that has attracted increasing research interest in recent times. Despite the popularity of the field, we remain to know rather little of the search mechanisms of MAs. Given the limited progress made on revealing the intrinsic properties of some commonly used complex benchmark problems and working mechanisms of Lamarckian memetic algorithms in...
متن کاملMemetic Algorithms: Parametrization and Balancing Local and Global Search
This chapter is devoted to the parametrization of memetic algorithms and how to find a good balance between global and local search. This is one of the most pressing questions when designing a hybrid algorithm. The idea of hybridization is to combine the advantages of different components. But if one components dominates another one, hybridization may become more hindering than useful and compu...
متن کاملLocal Search and Memetic Algorithms for Knapsack Problems
The 0-1 knapsack problem (KP) is widely studied in the last few decades. Despite of their simple structures, KP along with its extended versions belong to the class of NP-hard problems, and several optimization techniques have been developed to solve the problems. Some major examples are branch and bound methods and dynamic programming approaches [6], problemspecific heuristics [6], tabu search...
متن کاملMemetic Algorithms
Memetic Algorithms have become one of the key methodologies behind solvers that are capable of tackling very large, real-world, optimisation problems. They are being actively investigated in research institutions as well as broadly applied in industry. In this chapter we provide a pragmatic guide on the key design issues underpinning Memetic Algorithms (MA) engineering. We begin with a brief co...
متن کاملMemetic Algorithms
The term ‘Memetic Algorithms’ [74] (MAs) was introduced in the late 80s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a given problem. Special emphasis was given to the use of a population-based approach in which a set of cooperating and competing agents were engaged in periods of individual improvement of the solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memetic Computing
سال: 2009
ISSN: 1865-9284,1865-9292
DOI: 10.1007/s12293-009-0016-9